Structural Diagnosis of Wiring Networks: Finding Connected Components of Unknown Subgraphs
نویسندگان
چکیده
منابع مشابه
Structural Diagnosis of Wiring Networks: Finding Connected Components of Unknown Subgraphs
Given a graph G = (V, E), we want to find the vertex sets of the components of an unknown subgraph F = (V,E) of G, such that E ⊆ E. We learn about F by sending an oracle a query set S ⊆ V , and the oracle tells us the vertices connected to S in F . The objective is to use the minimum number of queries to partition the vertex set V into components of F . In electronic circuit design, the problem...
متن کاملDiagnosis of Wiring Networks: An Optimal Randomized Algorithm for Finding Connected Components of Unknown Graphs
We want to find the vertex sets of components of a graph G with a known vertex set V and unknown edge set E. We learn about G by sending an oracle a query set S ⊆ V , and the oracle tells us the vertices connected to S. The objective is to use the minimum number of queries to partition the vertex set into components. The problem is also known as interconnect diagnosis of wiring networks in VLSI...
متن کاملFinding Highly Connected Subgraphs
A popular way of formalizing clusters in networks are highly connected subgraphs, that is, subgraphs of k vertices that have edge connectivity larger than k/2 (equivalently, minimum degree larger than k/2). We examine the computational complexity of finding highly connected subgraphs. We show that the problem is NP-hard. Thus, we explore possible parameterizations, such as the solution size, nu...
متن کاملFinding Connected Secluded Subgraphs
Problems related to finding induced subgraphs satisfying given properties form one of the most studied areas within graph algorithms. Such problems have given rise to breakthrough results and led to development of new techniques both within the traditional P vs NP dichotomy and within parameterized complexity. The Π-Subgraph problem asks whether an input graph contains an induced subgraph on at...
متن کاملOptimal Algorithms for Finding Connected Components of an Unknown Graph
We want to nd the connected components of an unknown graph G with a known vertex set V. We learn about G by sending an oracle a query set S V , and the oracle tells us the vertices connected to S. We want to use the minimum number of queries, adaptively, to nd the components. The problem is also known as interconnect diagnosis of wiring networks in VLSI. The graph has n vertices and k component...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2001
ISSN: 0895-4801,1095-7146
DOI: 10.1137/s0895480100371286